Solving 10385 - Duathlon (Ternary search)

[andmenj-acm.git] / 10970 - Big Chocolate / p10970.cpp

#include <iostream>
using namespace std;

int main(){
  int n, m;
  while (cin >> n >> m){
    cout << (n*m)-1<<endl;
  }
  return 0;
}